منابع مشابه
Clustering with Minimum Spanning Trees
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of a set of representative points and removes edges that satisfy a predefined criterion. The process is repeat...
متن کاملOrderly Spanning Trees with Applications
We introduce and study orderly spanning trees of plane graphs. This algorithmic tool generalizes canonical orderings, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an orderly pair for any connected planar graph G, consisting of an embedded planar graph H isomorphic to G, and an orderly spanning ...
متن کاملSpanning Trees with Many Leaves1
A connected graph having large minimum vertex degree must have a spanning tree with many leaves. In particular, let l(n, k) be the maximum integer m such that every connected n-vertex graph with minimum degree at least k has a spanning tree with at least m leaves. Then l(n, 3) ≥ n/4 + 2, l(n, 4) ≥ (2n + 8) /5, and l(n, k) ≤ n − 3n/(k +1) + 2 for all k. The lower bounds are proved by an algori...
متن کاملSpanning Trees in 2-trees
A spanning tree of a graph G is a connected acyclic spanning subgraph of G. We consider enumeration of spanning trees when G is a 2-tree, meaning that G is obtained from one edge by iteratively adding a vertex whose neighborhood consists of two adjacent vertices. We use this construction order both to inductively list the spanning trees without repetition and to give bounds on the number of the...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2018
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-018-1973-x